Primitive groups synchronize non-uniform maps of extreme ranks
نویسندگان
چکیده
منابع مشابه
Primitive groups synchronize non-uniform maps of extreme ranks
Let ⌦ be a set of cardinality n, G a permutation group on ⌦, and f : ⌦ ! ⌦ a map which is not a permutation. We say that G synchronizes f if the semigroup hG, fi contains a constant map. The first author has conjectured that a primitive group synchronizes any map whose kernel is non-uniform. Rystsov proved one instance of this conjecture, namely, degree n primitive groups synchronize maps of ra...
متن کاملSynchronizing non-uniform maps
Let Ω be a set with n elements. A transformation monoid on Ω is a set of maps from Ω to itself which is closed under composition and contains the identity. A transformation monoid M is synchronizing if it contains a map with rank 1 (that is, whose image has only one element). The notion comes from automata theory. A (finite deterministic) automaton consists of a set Ω of states and a set S of t...
متن کاملcommuting and non -commuting graphs of finit groups
فرض کنیمg یک گروه غیر آبلی متناهی باشد . گراف جابجایی g که با نماد نمایش داده می شود ،گرافی است ساده با مجموعه رئوس که در آن دو راس با یک یال به هم وصل می شوند اگر و تنها اگر . مکمل گراف جابجایی g راگراف نا جابجایی g می نامیم.و با نماد نشان می دهیم. گرافهای جابجایی و ناجابجایی یک گروه متناهی ،اولین بار توسطاردوش1 مطرح گردید ،ولی در سالهای اخیر به طور مفصل در مورد بحث و بررسی قرار گرفتند . در ،م...
15 صفحه اولBlock Maps between Primitive Uniform and Pisot Substitutions
In this article, we prove that for all pairs of primitive Pisot or uniform substitutions with the same dominating eigenvalue, there exists a finite set of block maps such that every block map between the corresponding subshifts is an element of this set, up to a shift. This result is proved using a common generalization of block maps and substitutions, which we call dill maps.
متن کاملNon-Uniform Automata Over Groups
A new model, non-uniform deterministic finite automata (NUDFA’s) over general tinite monoids, has recently been developed as a strong link between the theory of finite automata and low-level parallel complexity. Achievements of this model include the proof that width 5 branching programs recognize exactly the languages in non-uniform NC’, NUDFA characterizations of several important subclasses ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2014
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2014.01.006